Wintein On All Strong Kleene Generalizations of Classical Logic

نویسندگان

  • Stefan Wintein
  • S. Wintein
چکیده

By using the notions of exact truth (‘true and not false’) and exact falsity (‘false and not true’), one can give 16 distinct definitions of classical consequence. This paper studies the class of relations that results from these definitions in settings that are paracomplete, paraconsistent or both and that are governed by the (extended) Strong Kleene schema. Besides familiar logics such as Strong Kleene logic (K3), the Logic of Paradox (LP) and First Degree Entailment (FDE), the resulting class of all Strong Kleene generalizations of classical logic also contains a host of unfamiliar logics. We first study the members of our class semantically, after which we present a uniform sequent calculus (the SK calculus) that is sound and complete with respect to all of them. Two further sequent calculi (the SK and SK calculus) will be considered, which serve the same purpose and which are obtained by applying general methods (due to Baaz et al.) to construct sequent calculi for many-valued logics. Rules and proofs in the SK calculus are much simpler and shorter than those of the SK and the SK calculus, which is one of the reasons to prefer the SK calculus over the latter two. Besides favourably comparing the SK calculus to both the SK and the SK calculus, we also hint at its philosophical

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On All Strong Kleene Generalizations of Classical Logic

By using the notions of exact truth (‘true and not false’) and exact falsity (‘false and not true’), one can give 16 distinct definitions of classical consequence. This paper studies the class of relations that results from these definitions in settings that are paracomplete, paraconsistent or both and that are governed by the (extended) Strong Kleene schema. Besides familiar logics such as Str...

متن کامل

From Closure Games to Strong Kleene Truth

In this paper, we study the method of closure games, a gametheoretic valuation method for languages of self-referential truth developed by the author. We prove two theorems which jointly establish that the method of closure games characterizes all 3and 4-valued Strong Kleene fixed points in a novel and informative manner. Amongst others, we also present closure games which induce the minimal an...

متن کامل

Interpolation Methods for Dunn Logics and Their Extensions

The semantic valuations of classical logic, strong Kleene logic, the logic of paradox and the logic of first-degree entailment, all respect the Dunn conditions: we call them Dunn logics. In this paper, we study the interpolation properties of the Dunn logics and extensions of these logics to more expressive languages. We do so by relying on the Dunncalculus, a signed tableau calculus whose rule...

متن کامل

Some remarks on generalizations of classical prime submodules

Let $R$ be a commutative ring with identity and $M$ be a unitary $R$-module. Suppose that $phi:S(M)rightarrow S(M)cup lbraceemptysetrbrace$ be a function where $S(M)$ is the set of all submodules of $M$. A proper submodule $N$ of $M$ is called an $(n-1, n)$-$phi$-classical prime submodule, if whenever $r_{1},ldots,r_{n-1}in R$ and $min M$ with $r_{1}ldots r_{n-1}min Nsetminusphi(N)$, then $r_{1...

متن کامل

On the Strict Tolerant Conception of Truth

We discuss four distinct semantic consequence relations which are based on Strong Kleene theories of truth and which generalize the notion of classical consequence to 3-valued logics. Then we set up a uniform signed tableau calculus (the strict-tolerant calculus) which we show to be sound and complete with respect to each of the four semantic consequence relations. The signs employed by our cal...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016